\documentclass[wideaddress,letterpaper]{resume}

\renewcommand{\categoryfont}{\sc}

%\usepackage{multicol}

%
% set the space used for category titles here:
% use the same value for oddsidemargin and marginparwidth [the latter
% 		will be reset to account for marginparsep]
%
\setlength{\oddsidemargin}{1in}
\setlength{\marginparwidth}{1in}
%
% calculate other dimensions [textwidth and evensidemargin]
% in function of oddsidemargin and marginparwidth:
% would be nicer to put in the class file...
%
\addtolength{\marginparwidth}{-\marginparsep}
 \setlength{\evensidemargin}{\oddsidemargin}
 \setlength{\textwidth}{\paperwidth}
 \addtolength{\textwidth}{-2in}
 \addtolength{\textwidth}{-2\oddsidemargin}
 \addtolength{\textwidth}{\marginparwidth}
 \addtolength{\textwidth}{\marginparsep}
%
%
\setlength{\topmargin}{-0.5in}
%
%
\renewcommand{\labelcitem}{$\diamond$}
%\renewcommand{\labelcitem}{}
%\renewcommand{\labelitemi}{$\cdot$}
\newcommand{\first}{$1^{\mbox{\scriptsize st}}$\ }
\newcommand{\second}{$2^{\mbox{\scriptsize nd}}$\ }
\newcommand{\third}{$3^{\mbox{\scriptsize rd}}$\ }

\author{Dr.~Michael H Dinitz}
% ------ Address --------------------------------------------------------

\address{Department of Computer Science\\
	Johns Hopkins University\\
	224 Croft Hall\\
	3400 North Charles Street\\
	Baltimore, MD 21218-2608\\
	(410) 516-7185\\
	\mbox{\small\tt mdinitz@cs.jhu.edu}\\
	\mbox{\small\tt http://www.cs.jhu.edu/$^{\sim}$mdinitz/}}{
	1020 Park Ave, Apt 908\\
	Baltimore, MD 21201\\
	(443) 449-8573}

\begin{document}
\maketitle

% --------- Research ----------------------------------------------------

\begin{category}{Research Interests}
\citemnobullet Algorithms, particularly approximation and online algorithms.  Hardness of approximation, combinatorial optimization, metric embeddings.  Applications to networking and distributed computing.
\end{category}


% ------- Education ---------------------------------------------------

\begin{category}{Education}

\citem{Carnegie Mellon University}, Pittsburgh, PA\\
Ph.D.~in Computer Science: August 2010\\
Thesis: \emph{Algorithms and Models for Problems in Networking}\\
Advisor: Anupam Gupta
%Thesis Committee: Anupam Gupta, Bruce Maggs, Avrim Blum, Matthew Andrews

\citem{Princeton University}, Princeton, NJ \\
A.B.~\emph{summa cum laude} in Computer Science, certificate in Applied and Computational Mathematics: June 2005\\
Awards and Honors: Shapiro Prize for Academic Excellence, 2003
%Thesis: \emph{Approximation Algorithms for {\sc Sparsest Cut}}.  Advisor: Sanjeev Arora

\citem{Champlain Valley Union High School}, Hinesburg, VT\\
Graduation Date: June 2001
\end{category}

% -------- Work experience --------------------------------------------

\begin{category}{Work Experience}

\citem{Assistant Professor}, Johns Hopkins University, Department of Computer Science: January 2014 - present.

\citem{Research Assistant Professor}, Johns Hopkins University, Department of Computer Science: August 2013 - January 2014.

\citem{Postdoctoral Fellow}, Weizmann Institute of Science: August 2010 - present.
%Postdoc in the Computer Science and Applied Mathematics Department at
%Weizmann, hosted by Robert Krauthgamer and David Peleg.  Research in approximation
%algorithms.

\citem{Research Intern}, Alcatel-Lucent Bell Labs: Summer 2009.
%Worked with Gordon Wilfong on problems related to the border gateway protocol and interdomain routing, especially on algorithms for disseminating external route information within an autonomous system.

\citem{Research Intern}, Alcatel-Lucent Bell Labs: Summer 2008.
%Worked with Matthew Andrews on the problem of maximizing wireless
%network capacity in the physical model.  Proved hardness results,
%algorithmic guarantees, and game-theoretic guarantees.

\citem{Research Intern}, Microsoft Research-Silicon Valley: Summer
2007.
%Worked at MSR-SVC under Dahlia Malkhi and Kunal Talwar.  Studied
%dynamic embeddings and embeddings with relaxed guarantees in the
%context of the Sequoia network latency prediction project.

%\citem{Counselor}, Governor's Institute of Vermont: Mathematics (Summer 2005, 2006)\\
%Head counselor at a week-long mathematics camp for Vermont high school students interested in mathematics.

%\citem{Lab TA}, Princeton University (September 2003 - May 2005)\\
%Assisted students enrolled in three classes: General Computer Science,
%Algorithms and Data Structures, and Introduction to Programming Systems

%\citem{Student Researcher}, University of Minnesota-Duluth (Summer
%2004)\\
%Attended the Duluth summer mathematics research program for
%undergraduates, funded by the NSF and run by Dr. Joseph Gallian.
%Studied tilings of finite abelian groups.  My results have been
%published in the SIAM Journal on Discrete Mathematics.

%\citem{Student Researcher}, Lafayette College (Summer 2003)\\
%Studied the theory of representing clutters as networks as part of the
%Lafayette Research Experience for Undergraduates program, which is
%funded by the NSF.  Worked with two other undergraduates and a
%professor of mathematics at Lafayette.  Our results have been
%submitted for publication.
\end{category}

% -------- Publications --------------------------------------------

\begin{category}{Publications (Peer-Reviewed)}

\citemnum Eden Chlamtac and {\bf Michael Dinitz}.  \emph{Lowest Degree k-Spanner: Approximation and Hardness}.  In Proceedings of the 17 International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2014).  

\citemnum {\bf Michael Dinitz}, Guy Kortsarz, and Zeev Nutov.  \emph{Improved Approximation Algorithm for Steiner $k$-Forest with Nearly Uniform Weights}.  In Proceedings of the 17 International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2014).  

\citemnum {\bf Michael Dinitz} and Merav Parter.  \emph{Braess's Paradox in Wireless Networks: The Danger of Improved Technology}.  In Proceedings of the 27th International Symposium on Distributed Computing (DISC 2013). 

\citemnum {\bf Michael Dinitz} and Anupam Gupta.  \emph{Packing Interdiction and Partial Covering Problems}.  In Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013).

\citemnum {\bf Michael Dinitz} and Guy Kortsarz.  \emph{Matroid Secretary for Regular and Decomposable Matroids}.  In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013).

\citemnum Eden Chlamtac, {\bf Michael Dinitz}, and Robert Krauthgamer.  \emph{Everywhere-Sparse Spanners via Dense Subgraphs}.  In Proceedings of the 53rd Annual Symposium on Foundations of Computer Science (FOCS 2012).

\citemnum {\bf Michael Dinitz} and Gordon Wilfong.  \emph{Constrained Connectivity and iBGP}.  In Proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2012).

\citemnum {\bf Michael Dinitz}, Guy Kortsarz, and Ran Raz.  \emph{Label Cover Instances with Large Girth and the Hardness of Approximating Basic $k$-Spanner}.  In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012).

\citemnum Atish Das Sarma, {\bf Michael Dinitz}, and Gopal Pandurangan.  \emph{Efficient Computation of Distance Sketches in Distributed Networks}.  In Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012).

\citemnum {\bf Michael Dinitz} and Robert Krauthgamer.
\emph{Fault-Tolerant Spanners: Better and Simpler}.  In Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC 2011).

\citemnum {\bf Michael Dinitz} and Robert Krauthgamer.  \emph{Directed Spanners via Flow-Based Linear Programs}.  In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC 2011).

\citemnum {\bf Michael Dinitz}. \emph{Distributed Algorithms for Approximating Wireless
  Network Capacity}.  In Proceedings of the 29th IEEE Conference on
Computer Communications (INFOCOM 2010).

\citemnum {\bf Michael Dinitz}, Jonah Gold, Thomas Sharkey, and Lorenzo Traldi. \emph{Graphical Representations of Clutters}.  Ars Combinatoria.  94 (2010), pp 303-320.

\citemnum Matthew Andrews and {\bf Michael Dinitz}. \emph{Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory}.  In Proceedings of the 28th IEEE Conference on Computer Communications (INFOCOM 2009).

\citemnum Moshe Babaioff, {\bf Michael Dinitz}, Anupam Gupta, Nicole Immorlica, and Kunal Talwar. \emph{Secretary Problems: Weights and Discounts}.  In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009).

\citemnum {\bf Michael Dinitz}. \emph{Online, Dynamic, and Distributed Embeddings of Approximate
  Ultrametrics}.  In Proceedings of the 22nd International Symposium
on Distributed Computing (DISC 2008).

\citemnum {\bf Michael Dinitz}. \emph{Compact Routing with Slack}. In
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of
Distributed Computing (PODC 2007).

\citemnum T.H.-Hubert Chan, {\bf Michael Dinitz}, and Anupam Gupta. \emph{Spanners With Slack}.  In Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006).

\citemnum {\bf Michael Dinitz}.  \emph{Full Rank Tilings of Finite Abelian Groups}. SIAM J. Discret. Math. 20, 1 (Jan. 2006), 160-170.

 \citemnum {\bf Michael Dinitz} and Jeffrey Dinitz.  \emph{Enumeration of Balanced Tournament Designs on 10
Points}.  Journal of Combinatorial Mathematics
and Combinatorial Computing, {\bf 52} (2005), 51-63

\end{category}


\begin{category}{Surveys}

\citemnum {\bf Michael Dinitz}.  Recent advances on the matroid secretary problem.  \emph{SIGACT News} 44, 2 (June 2013), 126-142

\end{category}

\begin{category}{Publications (Submitted)}

\citemnum {\bf Michael Dinitz}, Michael Schapira, and Asaf Valadarsky.  \emph{Explicit Expanding Expanders}.

\citemnum Asaf Valadarsky, {\bf Michael Dinitz}, and Michael Schapira.  \emph{Unveiling the Secrets of High-Throughput (Data) Networks}.

\citemnum {\bf Michael Dinitz}, Robert Krauthgamer, and Retsef Levi.  \emph{Process Flexibility: Budgets and Extensions}.
\end{category}

%\newpage


%\begin{category}{Work in Preparation}

%\citembullet {\bf Michael Dinitz}, Howard Karloff, Li Erran Li, and Gordon Wilfong.  \emph{Tight Bounds on Retransmission Permutations in OFDM Wireless Networks}.

%\citembullet {\bf Michael Dinitz} and Anupam Gupta. \emph{Approximation Algorithms for Sparse Packing Interdiction and Partial Covering Problems}.

%\end{category}


\begin{category}{Grants and Fellowships}

\citembullet National Science Foundation Graduate Research Fellowship
(September 2005 - September 2008)

\citembullet ARCS (Achievement Rewards for College Scientists)
Scholarship: \$15000

%\citembullet Travel Grant, ISMP 2009: \$800

%\citembullet Travel Grant, INFOCOM 2009: \$1562.50

%\citembullet Travel Grant, PODC 2007: \$300

\end{category}




\begin{category}{Teaching}
\citembullet 600.363 Introduction to Algorithms / 600.463 Algorithms I.  Fall 2014.
\citembullet 600.770 Selected Topics in Algorithms for Metric Spaces.  Spring 2014
\citembullet Teaching Assistant for 15-750 Graduate Algorithms, taught by Gary Miller.  Spring 2009
\citembullet Teaching Assistant for 15-451 Algorithms, taught by Avrim Blum.  Fall 2007
\citembullet Lab TA for COS 126 (General Computer Science), COS 217 (Introduction to Programming Systems), and COS 226 (Algorithms and Data Structures).  Fall 2003 - Spring 2005
\end{category}

\begin{category}{Program Committees}
\citembullet SPAA 2013: 25th ACM Symposium on Parallelism in Algorithms and Architectures

\citembullet CATS 2013: 19th Edition of Computing: the Australasian Theory Symposium
\end{category}

\begin{category}{Service}

\citembullet Guest Editor, ACM Transactions on Parallel Computing, special issue on selected papers from SPAA 2013.

\citembullet Conference reviewer for: STOC, FOCS, SODA, PODC, SPAA, ESA, ICALP, ITCS, APPROX, INFOCOM, IPDPS, COCOON
\citembullet Journal referee for: SIAM Journal on Computing,
SIAM Journal on Discrete Mathematics,
Transactions on Algorithms,
Algorithmica,
Discrete and Computational Geometry,
Computational Geometry: Theory and Applications,
Transactions on Networking,
Transactions on Mobile Computing,
Theoretical Computer Science,
Distributed Computing,
Transactions on Vehicular Technologies,
Transactions on Wireless Computing,
Transactions on Parallel and Distributed Systems,
International Journal of Algebra and Computation
\citembullet Grant reviewer for: NSERC Discovery Grants, US-Israel Binational Science Foundation.
\citembullet Co-Organizer, Johns Hopkins Theory Seminar (Fall 2014 - present).
\citembullet Member of search committee for Department Head, CMU Computer Science Department.  Fall 2009 - Winter 2010.
%\citembullet Member of Dec/5, the School of Computer Science graduate student social committee.  Fall 2005 - Spring 2010
%\citembullet Member of FreeCSD, the Computer Science Department graduate student social committee.  Fall 2005 - Spring 2010
%\citembullet President of the CMU Fencing Club.  Fall 2007 - Spring 2008
\citembullet Organized the CMU Computer Science Theory Lunch.  Spring 2006 - Fall 2006
\citembullet Member of the Computer Science Undergraduate Council.  Fall 2004 - Spring 2005
\end{category}



\begin{category}{Invited Talks}

\citembullet May 18, 2014: ``Label Cover Instances with Large Girth and the Hardness of Approximating Spanners".  Capital Area Theory Seminar, University of Maryland.  College Park, MD.  

\citembullet March 8, 2014: ``Matroid Secretary  for Regular and Decomposable Matroids".  University of Pennsylvania Theory Seminar.  Philadelphia, PA.

\citembullet January 29, 2014: ``Braess's Paradox in Wireless Networks: The Danger of Improved Technology".  Dagstuhl Seminar 14051: Algorithms for Wireless Communication.  Wadern, Germany.

\citembullet November 18, 2013: ``Matroid Secretary for Regular and Decomposable Matroids".  Tel Aviv University Algorithms Seminar.  Tel Aviv, Israel. 

\citembullet June 5, 2013: ``Matroid Secretary for Regular and Decomposable Matroids".  Technion CS Theory Seminar.  Haifa, Israel. 

\citembullet May 8, 2013: ``Matroid Secretary for Regular and Decomposable Matroids".  Hebrew University CS Theory Seminar.  Jerusalem, Israel.

\citembullet March 14, 2013: ``Approximating Spanners via Convex Relaxations".  Oregon State University.  Corvallis, OR.

\citembullet March 11, 2013: ``Approximating Spanners via Convex Relaxations".  Lehman College.  Bronx, NY.  

\citembullet March 8, 2013: ``Approximating Spanners via Convex Relaxations".  University of California Merced.  Merced, CA. 

\citembullet March 5, 2013: ``Approximating Spanners via Convex Relaxations".  Johns Hopkins University.  Baltimore, MD.

\citembullet February 28, 2013: ``Approximating Spanners via Convex Relaxations".  University of Massachussetts Amherst.  Amherst, MA.

\citembullet February 25, 2013: ``Approximating Spanners via Convex Relaxations".  University of Waterloo.  Waterloo, Ontario, Canada.

\citembullet February 2, 2013: ``Approximating Spanners via Convex Relaxations".  Colorado School of Mines.  Golden, CO.

\citembullet February 19, 2013: ``Approximating Spanners via Convex Relaxations".  Ohio State University.  Columbus, OH.

\citembullet February 8, 2013: ``Approximating Spanners via Convex Relaxations".  Florida State University.  Tallahassee, FL.

\citembullet November 14, 2012: ``Label Cover Instances with Large Girth and the Hardness of Approximating Basic $k$-Spanner".  Ben Gurion University Theory Seminar.  Beersheva, Israel.

\citembullet June 29, 2012: ``Everywhere-Sparse Spanners via Dense Subgraphs". Carnegie Mellon University Theory Seminar.  Pittsburgh, PA.

\citembullet May 24, 2012: ``Everywhere-Sparse Spanners via Dense Subgraphs". Bar Ilan University Computer Science Seminar.  Ramat Gan, Israel.

\citembullet April 4, 2012: ``Approximation Algorithms for Graph Spanners".  University of Haifa Computer Science Colloquium.  Haifa, Israel.

\citembullet March 26, 2012: ``Network Design Problems via Convex Relaxations".  Google Research.  New York, NY.

\citembullet March 21, 2012: ``Network Design Problems via Convex Relaxations".  University of Connecticut.  Storrs, CT.

\citembullet January 13, 2012: ``Network Design Problems via Convex Relaxations".  Alcatel-Lucent Bell Labs.  Murray Hill, NJ.

%\citembullet November 16, 2011: ``The secretary problem revisited: online auctions and matroids".  Weizmann Theory Lunch.  Rehovot, Israel.

\citembullet September 13, 2011: ``	Fault-Tolerant Spanners: Better and Simpler".  Warwick-Weizmann Workshop. Coventry, England.

%\citembullet June 7, 2011: ``Directed Spanners via Flow-Based Linear
%Programs.''  Symposium on Theory of Computing (STOC) 2011.  San Jose,
%California.

%\citembullet June 7, 2011: ``Fault-Tolerant Spanners: Better and
%Simpler.''  Symposium on Principles of Distributed Computing (PODC)
%2011.  San Jose, California.

\citembullet June 1, 2011: ``Directed Spanners via Flow-Based Linear
Programs.''  Technion Theory Seminar.  Haifa, Israel.

\citembullet April 6, 2011: ``Directed Spanners via Flow-Based Linear
Programs.''  Hebrew University CS Theory Seminar.  Jerusalem, Israel.

\citembullet April 5, 2011: ``Directed and Fault-Tolerant Spanners.''
Ben Gurion University Computer Science Colloquium.  Beersheva,
Israel.

\citembullet March 14, 2011: ``Directed Spanners via Flow-Based Linear
Programs.''  Tel Aviv University Algorithms Seminar.  Tel Aviv, Israel.

%\citembullet December 22, 2010: ``Set-Constrained Connectivity Problems."  Weizmann Theory Lunch.  Rehovot, Israel.

\citembullet December 8, 2010: ``Directed Spaners via Flow-Based Linear Programs."  Weizmann-Warwick Meeting 2010.  Weizmann Institute of Science.  Rehovot, Israel.

%\citembullet May 19, 2010: ``Algorithms and Models for Problems in Networking".  Carnegie Mellon University.  Pittsburgh, Pennsylvania.

\citembullet February 2, 2010: ``Approximating Wireless Network Capacity".  Los Alamos National Lab.  Los Alamos, New Mexico.

\citembullet January 20, 2010: ``Approximating Wireless Capacity in the Physical Model".  University of Vermont.  Burlington, Vermont.

\citembullet January 13, 2010: ``Wireless Network Capacity in the Physical Model".  West Virginia University.  Morgantown, West Virginia.

%\citembullet September 30, 2009: ``iBGP and Constrained Connectivity".  CMU Theory Lunch.  Pittsburgh, Pennsylvania.

\citembullet August 24, 2009: ``Wireless Network Capacity in the Physical Model".  International Symposium on Mathematical Programming (ISMP) 2009.  Chicago, Illinois.

%\citembullet August 12, 2009: ``Distributed Algorithms for Approximating Wireless Network Capacity".  Symposium on Principles of Distributed Computing (PODC) 2009.  Calgary, Alberta, Canada.

%\citembullet April 22, 2009: ``Maximizing Capacity in Arbitrary Wireless Networks
%  in the SINR Model: Complexity and Game Theory''.  Conference on
%  Computer Communications (INFOCOM) 2009. Rio de Janeiro, Brazil.

\citembullet March 27, 2009: ``Approximating Wireless Capacity in the Physical
  Model''.  University of Michigan.  Ann Arbor, Michigan

%\citembullet January 9, 2009: ``Secretary Problems: Weights and Discounts''.
%Symposium on Discrete Algorithms (SODA) 2009. New York, New York.

%\citembullet October 29, 2008: ``Maximizing Capacity in Arbitrary Wireless Networks
  %in the SINR Model: Complexity and Game Theory''.  CMU Theory Lunch.
  %Pittsburgh, Pennsylvania.

%\citembullet September 24, 2008: ``Online and Dynamic Embeddings of Approximate
%  Ultrametrics''.  International Symposium on Distributed Computing (DISC) 2008. Arcachon,
%France.

%\citembullet August 20, 2008: ``Distributed Algorithms for Ultrasparse
%Spanners and Linear Size Skeletons''.  Symposium on Principles of
%Distributed Computing (PODC) 2008.  Toronto, Ontario, Canada.  Talk given on
%behalf of Seth Pettie.

%\citembullet August 18, 2008: ``Online and Dynamic Embeddings of
%Approximate Ultrametrics''.  Symposium on Principles of Distributed
%Computing (PODC) 2008. Toronto, Ontario, Canada.

\citembullet June 14, 2008: ``Secretary Problems: Weights and
Discounts''.  Alcatel-Lucent Bell Labs.  Murray Hill, NJ.

%\citembullet April 16, 2008: ``The Discounted Secretary Problem''.
%CMU Theory Lunch.  Pittsburgh, Pennsylvania.

%\citembullet October 17, 2007: ``Compact Routing with Slack''.  CMU
%Theory Lunch.  Pittsburgh, Pennsylvania.

%\citembullet August 14, 2007: ``The Price of Anarchy in Network
%Creation Games''.  Symposium on Principles of Distributed Computing
%(PODC) 2007.  Portland, Oregon.  Talk given on behalf of Erik
%D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, and Morteza Zadimoghaddam

%\citembullet August 12, 2007: ``Compact Routing with Slack''.
%Symposium on Principles of Distributed Computing (PODC) 2007.
%Portland, Oregon.

\citembullet October 6, 2006: ``Spanners with Slack''.  Workshop on
Flexible Network Design.  Bertinoro, Italy.

%\citembullet  September 27, 2006: ``Spanners with Slack''.  CMU Theory
%Lunch.  Pittsburgh, Pennsylvania.

\citembullet September 1, 2004: ``Full Rank Tilings of Finite Abelian
Groups''.  University of Vermont.  Burlington, Vermont.
\end{category}



\begin{category}{Citizenship}
\citemnobullet United States of America
\end{category}

%\begin{category}{Languages}
%\citemnobullet English
%\end{category}
% -------- Reference --------------------------------------------

\begin{category}{References}
\citemnobullet Available upon request
%
%\begin{tabular}{ll}
%Anupam Gupta	& Robert Krauthgamer \\
%Computer Science Department & Mathematics and Computer Science\\
%Carnegie Mellon University & The Weizmann Institute of Science\\
%5000 Forbes Avenue & P.O.B. 26\\
%Pittsburgh, PA 15213 & Rehovot 76100, Israel \\
%(412) 268-7127 & +972-8-9344281 \\
%anupamg@cs.cmu.edu & robert.krauthgamer@weizmann.ac.il\\
%\\
%Matthew Andrews & Gordon Wilfong \\
%Alcatel-Lucent Bell Labs & Alcatel-Lucent Bell Labs \\
%Room MH 2C-356 & Room 2B-439 \\
%600 Mountain Ave & 600 Mountain Ave\\
%Murray Hill, NJ 07974 & Murray Hill, NJ 07974 \\
%(908) 582-2644 & (908) 582-3561  \\
%andrews@research.bell-labs.com & gtw@research.bell-labs.com \\
%\\
%David Peleg & Avrim Blum (teaching reference)\\
%Mathematics and Computer Science & Computer Science Department\\
%The Weizmann Institute of Science & Carnegie Mellon University\\
%P.O.B. 26 & 5000 Forbes Avenue\\
%Rehovot 76100, Israel & Pittsburgh, PA 15213\\
%+972-8-9343478 & (412) 268-3505 \\
%david.peleg@weizmann.ac.il & avrim@cs.cmu.edu
%\end{tabular}

\end{category}

\end{document}
